Sperner's Lemma
نویسنده
چکیده
In this article we introduce and prove properties of simplicial complexes in real linear spaces which are necessary to formulate Sperner's lemma. The lemma states that for a function f , which for an arbitrary vertex v of the barycentric subdivision B of simplex K assigns some vertex from a face of K which contains v, we can find a simplex S of B which satisfies f (S) = K (see [10]). The notation and terminology used in this paper have been introduced in the We follow the rules: x, y, X denote sets and n, k denote natural numbers. The following two propositions are true: (1) Let R be a binary relation and C be a cardinal number. If for every x such that x ∈ X holds Card(R • x) = C, then Card R = Card(R(dom R \ X)) + C · Card X. (2) Let Y be a non empty finite set. Suppose Card X = Y + 1. Let f be a function from X into Y. Suppose f is onto. Then there exists y such that y ∈ Y and Card(f −1 ({y})) = 2 and for every x such that x ∈ Y and x = y holds Card(f −1 ({x})) = 1.
منابع مشابه
An Infinitary Version of Sperner's Lemma
We prove an extension of the well-known combinatorial-topological lemma of E. Sperner [20] to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem .
متن کاملA note on kernels and Sperner's Lemma
The kernel-solvability of perfect graphs was first proved by Boros and Gurvich, and later Aharoni andHolzmangave a shorter proof. Bothproofswere based on Scarf’s Lemma. In this note we show that a very simple proof can be given using a polyhedral version of Sperner’s Lemma. In addition, we extend the Boros–Gurvich theorem to h-perfect graphs and to a more general setting. © 2009 Elsevier B.V. A...
متن کاملPPAD-completeness of polyhedral versions of Sperner's Lemma
We show that certain polyhedral versions of Sperner’s Lemma, where the colouring is given explicitly as part of the input, are PPAD-complete. The proofs are based on two recent results on the complexity of computational problems in game theory: the PPAD-completeness of 2-player Nash, proved by Chen and Deng, and of Scarf’s Lemma, proved by Kintali. We show how colourings of polyhedra provide a ...
متن کاملOrientability of Pseudomanifold and Generalizations of Sperner's Lemma
We propose a combinatorial framework for fixed point algorithms and constructive proofs of combi· natoriallemmas in topology. The framework consists of two sets of pseudomanifolds and an operator relating them. They have lattice structures which are dual to each other. We show that the set of "joins" of pseudomanifolds related by the operator is a homogeneous and orientable pseudomanifold under...
متن کاملMultilabeled versions of Sperner's and Fan's lemmas and applications
We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner’s lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan’s lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and ...
متن کاملA Borsuk-Ulam Equivalent that Directly Implies Sperner's Lemma
We show that Fan’s 1952 lemma on labelled triangulations of the n-sphere with n + 1 labels is equivalent to the Borsuk–Ulam theorem. Moreover, unlike other Borsuk–Ulam equivalents, we show that this lemma directly implies Sperner’s Lemma, so this proof may be regarded as a combinatorial version of the fact that the Borsuk–Ulam theorem implies the Brouwer fixed-point theorem, or that the Lustern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formalized Mathematics
دوره 18 شماره
صفحات -
تاریخ انتشار 2010